How loss and delay correlations affect TCP pseudo self-similarity
نویسندگان
چکیده
In this paper we exploit a model of a single TCP source introduced in [1] to show the dependence of the scaling properties of the TCP throughput on the correlation structure of the Round Trip Times (RTTs) and of the packet losses. The source works according to the most common TCP mechanisms, i.e. slow-start, congestion avoidance and exponential back-off retransmission timer. The innovation of the model consists in the representation of the network feedback on the source: we use suitable list of RTTs to feed the model simulating the TCP source, as the statistics of the RTTs reflect the network collective behavior, including the congestion periods. Using this model we have carefully analyzed the second-order scaling behaviour of the throughput of the single TCP source in a limited range of time scales, i.e. its pseudo self-similarity. We show that the pseudo self-similarity of the throughput depends significantly on the correlation structure of the losses. In order to support our findings, we have considered lists of RTTs measured in real networks as well as synthetic traces with suitable correlation structures.
منابع مشابه
How Does TCP Generate Pseudo-Self-Similarity?
Long-range dependence has been observed in many recent Internet traffic measurements. In addition, some recent studies have shown that under certain network conditions, TCP itself can produce traffic that exhibits dependence over limited timescales, even in the absence of higher-level variability. In this paper, we use a simple Markovian model to argue that when the loss rate is relatively high...
متن کاملSelf-Similarity of AQM Filtered Traffic
Self-similarity of network traffic is a well-known paradigm for more than a decade, now. Following the first realization of this property, it has been a popular issue to question if the self-similarity persisted with the changing network architectures and conditions. However, the effects of Active Queue Management (AQM) mechanisms over the self-similarity of network traffic have almost been lef...
متن کاملA Differentiated Pricing Framework for Improving the Performance of the Elastic Traffics in Data Networks
Rate allocation has become a demanding task in data networks as diversity in users and traffics proliferate. Most commonly used algorithm in end hosts is TCP. This is a loss based scheme therefore it exhibits oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is based on the aggregate throughput, losses that are caused by TCP affect other sessions...
متن کاملInternational Conference on Performance and Control of Netork Systems On the E ect of Tra c Self - similarity on Network Performance
Recent measurements of network tra c have shown that self-similarity is an ubiquitous phenomenon present in both local area and wide area tra c traces. In previous work, we have shown a simple, robust application layer causal mechanism of tra c self-similarity, namely, the transfer of les in a network system where the le size distributions are heavy-tailed. In this paper, we study the e ect of ...
متن کاملOn the Contribution of TCP to the Self-Similarity of Network Traffic
Recent research has shown the presence of self-similarity in TCP traac which is unaaected by the application level and human factors. This suggests the presence of protocol level contributions to network traac self-similarity, at least in certain time scales where the eeect of protocol behavior is most prominent. In this paper we show how TCP's retransmission and congestion control mechanism co...
متن کامل